منابع مشابه
Countable connected-homogeneous graphs
A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the countably infinite connectedhomogeneous graphs. We prove that if Γ is connected countably infinite and connected-homogeneous then Γ is isomorphic to one of: Lachlan and Woodrow’s ultrahomogeneous graphs; the generic bipartite graph...
متن کاملHomogeneous Countable Connected Hausdorff Spaces
In 1925, P. Urysohn gave an example of a countable connected Hausdorff space [4]. Other examples have been contributed by R. Bing [l], M. Brown [2], and E. Hewitt [3]. Relatively few of the properties of such spaces have been examined. In this paper the question of homogeneity is studied. Theorem I shows that there exists a bihomogeneous countable connected Hausdorff space. Theorems II and III ...
متن کاملCountable homogeneous multipartite graphs
We give a classification of all the countable homogeneous multipartite graphs. This generalizes the similar result for bipartite graphs given in [5]. 2010 Mathematics Subject Classification 05C99 keywords: multipartite graph, homogeneous, classification
متن کاملCycle-types in the automorphism groups of countable homogeneous graphs
We give a classification of all the cycle types occurring in the automorphism groups of countable homogeneous graphs.
متن کاملA Ramsey theorem for countable homogeneous directed graphs
Let T be a ,nite set of ,nite tournaments and HT the countable homogeneous directed graph which does not embed any of the tournaments in T. We will completely describe the vertex partition property HT. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2010
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2009.04.002